https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19330 Thu 06 Aug 2015 10:47:12 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13205 ir(G) (open irratic number X_oir(G)of a graph G equals the minimum order of an irredundant (open irredundant) coloring of G. In this paper we present several results on these two parameters.]]> Sat 24 Mar 2018 10:35:49 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21683 G = (V, E) be a graph. A subset S of V is called an equivalence set if every component of the induced subgraph <S is complete. In this paper starting with the concept of equivalence set as seed property, we form an inequality chain of six parameters, which we call the equivalence chain of G. WE present several basic results on these parameters and problems for further investigation.]]> Sat 24 Mar 2018 08:02:55 AEDT ]]>